Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
نویسندگان
چکیده
Given a simple polygon P , we consider the problem of finding a convex polygon Q contained in P that minimizes H(P, Q), where H denotes the Hausdorff distance. We call such a polygon Q a Hausdorff core of P . We describe polynomial-time approximations for both the minimization and decision versions of the Hausdorff core problem, and we provide an argument supporting the hardness of the problem.
منابع مشابه
The Hausdorff Core Problem on Simple Polygons
We present a study of the Hausdorff Core problem on simple polygons. A polygon Q is a k-bounded Hausdorff Core of a polygon P if P contains Q, Q is convex, and the Hausdorff distance between P and Q is at most k. A Hausdorff Core of P is a k-bounded Hausdorff Core of P with the minimum possible value of k, which we denote kmin. Given any k and any ε > 0, we describe an algorithm for computing a...
متن کاملHausdorff core of a one reflex vertex polygon
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q contained inside P which minimizes the Hausdorff distance between P andQ. Our algorithm essentially consists of rotating a line about the reflex vertex; this line defines a convex polygon by cutting P . To determine t...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملMapping Polygons to the Grid with Small Hausdorff and Fréchet Distance
We show how to represent a simple polygon P by a grid (pixel-based) polygon Q that is simple and whose Hausdorff or Fréchet distance to P is small. For any simple polygon P , a grid polygon exists with constant Hausdorff distance between their boundaries and their interiors. Moreover, we show that with a realistic input assumption we can also realize constant Fréchet distance between the bounda...
متن کاملar X iv : m at h / 04 07 50 3 v 1 [ m at h . M G ] 2 8 Ju l 2 00 4 SEPARATED SETS AND THE FALCONER CONJECTURE FOR POLYGONAL NORMS
The Falconer conjecture [F86] asserts that if E is a planar set with Hausdorff dimension strictly greater than 1, then its Euclidean distance set ∆(E) has positive one-dimensional Lebesgue measure. We discuss the analogous question with the Euclidean distance replaced by non-Euclidean norms ‖ · ‖X in which the unit ball is a polygon with 2K sides. We prove that for any such norm, and for any α ...
متن کامل